Adjacency on the constrained assignment problem

The over-constrained airport gate assignment problem

In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated 4ights and total walking distances or connection times. We 7rst use a greedy algorithm to minimize ungated 4ights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used....

The Two Dimensional, Inequality Constrained, Multi-Assignment Problem

Regional Search for the Resource Constrained Assignment Problem

The resource constrained assignment problem (RCAP) is to find a minimal cost partition of the nodes of a directed graph into cycles such that a resource constraint is fulfilled. The RCAP has its roots in rolling stock rotation optimization where a railway timetable has to be covered by rotations, i.e., cycles. In that context, the resource constraint corresponds to maintenance constraints for r...

Local Search for the Resource Constrained Assignment Problem

The resource constrained assignment problem (RCAP) is to find a minimal cost cycle partition in a directed graph such that a resource constraint is fulfilled. The RCAP has its roots in an application that deals with the covering of a railway timetable by rolling stock vehicles. Here, the resource constraint corresponds to maintenance constraints for rail vehicles. Moreover, the RCAP generalizes...

Approximation Algorithms for the Multiply Constrained Assignment Problem

We consider the multiply constrained assignment problem (MCAP), which is a variation of the linear assignment problem with m additional constraints. First, we derive upper and lower bounds respectively by heuristic and relaxation methods. The latter also implies the Lagrangian relaxation, as well. Next, we introduce the pegging test to MCAP, and further a virtual pegging test to reduce MCAP int...